منابع مشابه
The Even Cycle Problem for Directed Graphs
If each arc in a strongly connected directed graph of minimum in-degree and outdegree at least 3 is assigned a weight 0 or 1, then the resultingweighted directed graph has a directed cycle of even total weight. This provesa conjecture made by L. Lovasz in 1975 and has applications to colour-criticalhypergraphs, sign-nonsingular matrices, and permanents of matrices. MATHEMATICAL ...
متن کاملEven Cycles in Directed Graphs
It is proved that every strongly connected directed graph with n nodes and at least ⌊(n + 1)/4⌋ edges must contain an even cycle. This is best possible, and the structure of extremal graphs is discussed.
متن کامل5 - The Even Cycle Problem
For k ≥ 2 and l ≥ 0, let C (k, l) denote the family of all cycles of length l modulo k, and C (k) := C (l, 0). In proving the Even Cycle Theorem, we determine almost tight bounds on ex(n,C (k, l)) as well as a method for giving upper bounds on ex(n,C ) for various other infinite families of cycles. Bollobás [2] was the first to show that ex(n,C (k, l)) is linear in n for each pair (k, l) such t...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولStrongly even cycle decomposable graphs
We introduce the notion of an Eulerian graph being strongly evencycle decomposable, and note that a few basic classes have this property. Our main results are that several fundamental composition operations that preserve the property of being Eulerian also preserve the property of being strongly even-cycle decomposable. As an application, our composition operations easily imply that all Euleria...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the American Mathematical Society
سال: 1992
ISSN: 0894-0347
DOI: 10.1090/s0894-0347-1992-1135027-1